On 3-colorings of E(Kn)
نویسندگان
چکیده
منابع مشابه
Acyclic 3-Colorings and 4-Colorings of Planar Graph Subdivisions
An acyclic coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color and every cycle in G has vertices of at least three different colors. An acyclic k-coloring of G is an acyclic coloring of G with at most k colors. It is NP-complete to decide whether a planar graph G with maximum degree four admits an acyclic 3-coloring [1]...
متن کاملForbidden Subgraphs and 3-Colorings
A graph G is said to satisfy the Vizing bound if χ(G) ≤ ω(G) + 1, where χ(G) and ω(G) denote the chromatic number and clique number of G, respectively. The class of graphs satisfying the Vizing bound is clearly χ-bounded in the sense of Gyárfás. It has been conjectured that if G is triangle-free and fork-free, where the fork is obtained from K1,4 by subdividing two edges, then G satisfies the V...
متن کاملOn the Number of 3-Edge Colorings of Cubic Graphs
In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221–244 on the number of 3-edge colorings of a plane cubic graph. We also show that the number of 3-edge colorings of cubic graphs can be computed (up to a fa...
متن کاملMeasurable 3-colorings of Acyclic Graphs
This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona. Our main result here is that acyclic locally finite analytic graphs on Polish spaces admit Baire measurable 3-colorings.
متن کامل3-consecutive C-colorings of graphs
A 3-consecutive C-coloring of a graph G = (V, E) is a mapping φ : V → N such that every path on three vertices has at most two colors. We prove general estimates on the maximum number χ̄3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with χ̄3CC(G) ≥ k for k = 3 and k = 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90071-z